翻訳と辞書 Words near each other ・ Geometric dynamic recrystallization ・ Geometric feature learning ・ Geometric finiteness ・ Geometric flow ・ Geometric function theory ・ Geometric genus ・ Geometric graph theory ・ Geometric group action ・ Geometric group theory ・ Geometric hashing ・ Geometric integration ・ Geometric integrator ・ Geometric invariant theory ・ Geometric Langlands correspondence ・ Geometric lathe ・ Geometric lattice ・ Geometric magic square ・ Geometric mean ・ Geometric mean theorem ・ Geometric measure of entanglement ・ Geometric measure theory ・ Geometric mechanics ・ Geometric median ・ Geometric modeling ・ Geometric modeling kernel ・ Geometric moray ・ Geometric Morphometrics in Anthropology ・ Geometric Mouse, Variation I, Scale A ・ Geometric networks ・ Geometric phase Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Geometric lattice ： ウィキペディア英語版 Geometric lattice In the mathematics of matroids and lattices, a geometric lattice is a finite atomistic semimodular lattice, and a matroid lattice is an atomistic semimodular lattice without the assumptions of finiteness. Geometric lattices and matroid lattices, respectively, form the lattices of flats of finite and infinite matroids, and every geometric or matroid lattice comes from a matroid in this way. ==Definition== Recall that a lattice is a partially ordered set in which any two elements $x$ and $y$ have a least upper bound $x\backslash vee\; y$ and a greatest lower bound $x\backslash wedge\; y$. In a lattice, or more generally a partially ordered set, an element $x$ covers another element $y$ (written as $x\; :>\; y$ or ) if $x\; >\; y$ and there is no third element $z$ between $x$ and $y$. A lattice or partially ordered set is graded when it can be given a rank function $r(x)$ mapping its elements to integers, such that $r(x)>r(y)$ whenever $x>y$ and in particular $r(x)=r(y)+1$ whenever even $x\; :>\; y$. In a lattice having a bottom element, one may assume without loss of generality that its rank is zero. The atoms of such a lattice are the elements with rank one, and the lattice is atomistic if every element is the least upper bound of some set of atoms. A graded lattice is semimodular if, for every $x$ and $y$, its rank function obeys the identity〔, Theorem 15, p. 40. More precisely, Birkhoff's definition reads "We shall call P (upper) semimodular when it satisfies: If ''a''≠''b'' both cover ''c'', then there exists a ''d''∈''P'' which covers both ''a'' and ''b''" (p.39). Theorem 15 states: "A graded lattice of finite length is semimodular if and only if ''r''(''x'')+''r''(''y'')≥''r''(''x''∧''y'')+''r''(''x''∨''y'')".〕 :$r(x)+r(y)\backslash ge\; r(x\backslash wedge\; y)+r(x\backslash vee\; y).\; \backslash ,$ A matroid lattice is a lattice that is both atomistic and semimodular,〔.〕〔.〕 and a geometric lattice is a matroid lattice with finitely many elements.〔, p. 51.〕 Some authors consider only finite matroid lattices, and use the terms "geometric lattice" and "matroid lattice" interchangeably for both.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Geometric lattice」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.